TSTP Solution File: NUM663^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM663^1 : TPTP v8.1.2. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:56:05 EDT 2024
% Result : Theorem 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of formulae : 22 ( 9 unt; 5 typ; 0 def)
% Number of atoms : 28 ( 5 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 66 ( 11 ~; 7 |; 0 &; 44 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 4 con; 0-2 aty)
% Number of variables : 10 ( 0 ^ 10 !; 0 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
nat: $tType ).
thf(decl_22,type,
x: nat ).
thf(decl_23,type,
y: nat ).
thf(decl_24,type,
z: nat ).
thf(decl_25,type,
less: nat > nat > $o ).
thf(satz16a,conjecture,
less @ x @ z,
file('/export/starexec/sandbox2/tmp/tmp.UaH9UNzJNP/E---3.1_17068.p',satz16a) ).
thf(satz15,axiom,
! [X2: nat,X3: nat,X4: nat] :
( ( less @ X2 @ X3 )
=> ( ( less @ X3 @ X4 )
=> ( less @ X2 @ X4 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.UaH9UNzJNP/E---3.1_17068.p',satz15) ).
thf(l,axiom,
( ~ ( less @ x @ y )
=> ( x = y ) ),
file('/export/starexec/sandbox2/tmp/tmp.UaH9UNzJNP/E---3.1_17068.p',l) ).
thf(k,axiom,
less @ y @ z,
file('/export/starexec/sandbox2/tmp/tmp.UaH9UNzJNP/E---3.1_17068.p',k) ).
thf(c_0_4,negated_conjecture,
~ ( less @ x @ z ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz16a])]) ).
thf(c_0_5,plain,
! [X9: nat,X10: nat,X11: nat] :
( ~ ( less @ X9 @ X10 )
| ~ ( less @ X10 @ X11 )
| ( less @ X9 @ X11 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz15])])]) ).
thf(c_0_6,plain,
( ~ ( less @ x @ y )
=> ( x = y ) ),
inference(fof_simplification,[status(thm)],[l]) ).
thf(c_0_7,negated_conjecture,
~ ( less @ x @ z ),
inference(fof_nnf,[status(thm)],[c_0_4]) ).
thf(c_0_8,plain,
! [X2: nat,X3: nat,X4: nat] :
( ( less @ X2 @ X4 )
| ~ ( less @ X2 @ X3 )
| ~ ( less @ X3 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_9,plain,
less @ y @ z,
inference(split_conjunct,[status(thm)],[k]) ).
thf(c_0_10,plain,
( ( less @ x @ y )
| ( x = y ) ),
inference(fof_nnf,[status(thm)],[c_0_6]) ).
thf(c_0_11,negated_conjecture,
~ ( less @ x @ z ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_12,plain,
! [X2: nat] :
( ( less @ X2 @ z )
| ~ ( less @ X2 @ y ) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
thf(c_0_13,plain,
( ( less @ x @ y )
| ( x = y ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_14,negated_conjecture,
~ ( less @ x @ y ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
thf(c_0_15,plain,
x = y,
inference(sr,[status(thm)],[c_0_13,c_0_14]) ).
thf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_15]),c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM663^1 : TPTP v8.1.2. Released v3.7.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n006.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 09:11:19 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running higher-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.UaH9UNzJNP/E---3.1_17068.p
% 0.21/0.50 # Version: 3.1.0-ho
% 0.21/0.50 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.21/0.50 # Starting ho_unfolding_6 with 300s (1) cores
% 0.21/0.50 # Starting sh4l with 300s (1) cores
% 0.21/0.50 # Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.21/0.50 # ho_unfolding_6 with pid 17184 completed with status 0
% 0.21/0.50 # Result found by ho_unfolding_6
% 0.21/0.50 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.21/0.50 # Starting ho_unfolding_6 with 300s (1) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: HGUSF-FFSF00-SFFFFFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting new_ho_10 with 181s (1) cores
% 0.21/0.50 # new_ho_10 with pid 17188 completed with status 0
% 0.21/0.50 # Result found by new_ho_10
% 0.21/0.50 # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting new_ho_10 with 1500s (5) cores
% 0.21/0.50 # Starting ho_unfolding_6 with 300s (1) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: HGUSF-FFSF00-SFFFFFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting new_ho_10 with 181s (1) cores
% 0.21/0.50 # Preprocessing time : 0.001 s
% 0.21/0.50 # Presaturation interreduction done
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Theorem
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.50 # Parsed axioms : 10
% 0.21/0.50 # Removed by relevancy pruning/SinE : 0
% 0.21/0.50 # Initial clauses : 10
% 0.21/0.50 # Removed in clause preprocessing : 6
% 0.21/0.50 # Initial clauses in saturation : 4
% 0.21/0.50 # Processed clauses : 12
% 0.21/0.50 # ...of these trivial : 0
% 0.21/0.50 # ...subsumed : 0
% 0.21/0.50 # ...remaining for further processing : 12
% 0.21/0.50 # Other redundant clauses eliminated : 0
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 0
% 0.21/0.50 # Backward-rewritten : 3
% 0.21/0.50 # Generated clauses : 5
% 0.21/0.50 # ...of the previous two non-redundant : 6
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 0
% 0.21/0.50 # Paramodulations : 4
% 0.21/0.50 # Factorizations : 0
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 0
% 0.21/0.50 # Disequality decompositions : 0
% 0.21/0.50 # Total rewrite steps : 5
% 0.21/0.50 # ...of those cached : 3
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 4
% 0.21/0.50 # Positive orientable unit clauses : 2
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 0
% 0.21/0.50 # Non-unit-clauses : 2
% 0.21/0.50 # Current number of unprocessed clauses: 1
% 0.21/0.50 # ...number of literals in the above : 3
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 8
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 3
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 2
% 0.21/0.50 # Non-unit clause-clause subsumptions : 0
% 0.21/0.50 # Unit Clause-clause subsumption calls : 2
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 1
% 0.21/0.50 # BW rewrite match successes : 1
% 0.21/0.50 # Condensation attempts : 12
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 385
% 0.21/0.50 # Search garbage collected termcells : 44
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.004 s
% 0.21/0.50 # System time : 0.001 s
% 0.21/0.50 # Total time : 0.005 s
% 0.21/0.50 # Maximum resident set size: 1592 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.006 s
% 0.21/0.50 # System time : 0.003 s
% 0.21/0.50 # Total time : 0.009 s
% 0.21/0.50 # Maximum resident set size: 1712 pages
% 0.21/0.50 % E---3.1 exiting
% 0.21/0.50 % E exiting
%------------------------------------------------------------------------------